a quasiconvex optimization problem; can be solved by bisection example: Von Neumann model of a growing economy maximize (over x, x. +. ) mini=1,...,n x. + i.
由 E Hazan 著作 · 2015 · 被引用 181 次 — In this paper we analyze a stochastic version of NGD and prove its convergence to a global minimum for a wider class of functions: we require ...
由 A Agrawal 著作 · 2020 · 被引用 42 次 — Disciplined quasiconvex programming generalizes disciplined convex programming, the class of optimization problems targeted by most modern.
由 VA Ubhaya 著作 · 1986 · 被引用 19 次 — This article obtains optimal solutions to the problem and derives their properties. This problem arises in the context of curve fitting or estimation.
Mathematical optimization edit ... In nonlinear optimization, quasiconvex programming studies iterative methods that converge to a minimum (if one exists) for ...
Optimization is the science of making a best choice in the face of conflicting requirements. Any convex optimization problem has geometric interpretation.
由 JAS Gromicho 著作 · 被引用 78 次 — More recently, this algorithm has been used by Carrizosa and Plastria to solve a global optimization problem in facility location (Ref. [16]). The distinction ...
由 Q Ke 著作 · 被引用 234 次 — Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images.
由 A Agrawal 著作 · 2019 · 被引用 42 次 — Disciplined quasiconvex programming generalizes disciplined convex programming, the class of optimization problems targeted by most modern ...
